The application of two-level morphology to non-concatenative German morphology

نویسنده

  • Harald Trost
چکیده

In this paper2 I describe a hybrid system for morphological analysis and synthesis. This system consists of two parts. The treatment of morphonology and non-concatenative morphology is based on the two-level approach proposed by Koskenniemi (1983). For the concatenative part of morphosyntax (i.e. affixation) a grammar based on featureunification is made use of. Both parts rely on a morph lexicon. Combinations of two-level morphology with feature-based morphosyntactic grammars have already been proposed by several authors (c.f. Bear 1988a, Carson 1988, Görz & Paulus 1988, Schiller & Steffens 1989) to overcome the shortcomings of the continuationclasses originally proposed by Koskenniemi (1983) and Karttunen (1983) for the description of morphosyntax. But up to now no linguistically satisfying solution has been proposed for the treatment of non-concatenative morphology in such a framework. In this paper I describe an extension to the model which will allow for the description of such phenomena. Namely it is proposed to restrict the applicability of two-level rules by providing them with filters in the form of feature structures. It is demonstrated how a wellknown problem of German morphology, so-called "Umlautung", can be described in this approach in a linguistically motivated and efficient way. 1 Work on this project has begun when I was working for the Austrian Research Institute for Artificial Intelligence in Vienna, Austria. 2 I want to thank my collegues Greg Dogil, Wolfgang Heinz, Tibor Kiss and Günter Neumann for fruitful discussions and helpful comments on earlier versions of this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Constraint-based Morphological Analyzer for Concatenative and Non-concatenative Morphology

Morphological analysis in the current methods, such as finite-state and unification-based, are predominantly effective for handling concatenative morphology (e.g. prefixation and suffixation), although some of these techniques can also handle limited non-concatenative phenomena (e.g. infixation and partial and full-stem reduplication). A constraint-based method to perform morphological analysis...

متن کامل

Prosodic Inheritance And Morphological Generalisations

Prosodic Inheritance (PI) morphology provides uniform treatment of both concatenative and non-concatenative morphological and phonological generalisations using default inheritance. Models of an extensive range of German Umlaut and Arabic intercalation facts, implemented in DATR, show that the PI approach also covers 'hard cases' more homogeneously and more extensively than previous computation...

متن کامل

Learning non-concatenative morphology

Recent work in computational psycholinguistics shows that morpheme lexica can be acquired in an unsupervised manner from a corpus of words by selecting the lexicon that best balances productivity and reuse (e.g. Goldwater et al. (2009) and others). In this paper, we extend such work to the problem of acquiring non-concatenative morphology, proposing a simple model of morphology that can handle ...

متن کامل

NON-C ONCATENATIVE DERIVATION Other Processes

This chapter provides an overview of a wide range of non-concatenative (nonreduplicative) phenomena in morphology focusing on a typological categorization.1 The definition of non-concatenative morphology is not uncontroversial. Kurisu (2001: 2) considers non-concatenative morphology to be observed in cases where the phonological instantiation of a morpheme cannot be demarcated in an output repr...

متن کامل

Finite-State Non-Concatenative Morphotactics

Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it has long been recognized that these implementations have serious limitations in handling non-concatenative phenomena. We describe a new technique for constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990